On starting and stopping criteria for nested primal-dual iterations
نویسندگان
چکیده
منابع مشابه
Stopping criteria for iterations in finite element methods
This work extends the results of Arioli [1], [2] on stopping criteria for iterative solution methods for finite element problems to the case of nonsymmetric positive-definite problems. We show that the residual measured in the norm induced by the symmetric part of the inverse of the system matrix is relevant to convergence in a finite element context. We then provide alternative ways of calcula...
متن کاملFast and Exact Primal-Dual Iterations for Variational Problems in Computer Vision
The saddle point framework provides a convenient way to formulate many convex variational problems that occur in computer vision. The framework unifies a broad range of data and regularization terms, and is particularly suited for nonsmooth problems such as Total Variation-based approaches to image labeling. However, for many interesting problems the constraint sets involved are difficult to ha...
متن کاملPrimal and dual optimality criteria in convex programming
A B S T RAe T This paper considers the problem of minimizing a convex-differentiable function subject to convex differentiable constraints. Necessary and sufficient conditions (not requiring any constraints qualification) for a point to be an optimal solution are given in terms of a parametric I inear program. Dual characterization theorems are then derived, which generalizes the classical resu...
متن کاملThe Role of the Inner Product in Stopping Criteria for Conjugate Gradient Iterations
Two natural and efficient stopping criteria are derived for conjugate gradient (CG) methods, based on iteration parameters. The derivation makes use of the inner product matrix B defining the CG method. In particular, the relationship between the eigenvalues and B-norm of a matrix is investigated, and it is shown that the ratio of largest to smallest eigenvalues defines the B-condition number o...
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algorithms
سال: 2018
ISSN: 1017-1398,1572-9265
DOI: 10.1007/s11075-018-0616-x